A Comparative Introduction to CSP, CCS and LOTOS
نویسنده
چکیده
The language features and formal definitions of the three most popular process algebras, csp, ccs and lotos, are introduced and compared.
منابع مشابه
A Comparative
The language features and formal deenitions of the three most popular process algebras, csp, ccs and lotos, are introduced and compared.
متن کاملA Subset of Lotos with the Computat ional Power of P lace / Trans i t ion - Nets 1
Topics: Relationships between net theory and other approaches. 1. I n t r o d u c t i o n In this paper, we define a subset of Basic Lotos [Bolo 87, ISO 88] that can be modelled by finite Place/Transition-nets (P/T-nets). That means that specifications in that Lotos subset can be represented and translated into finite P/T-nets and validated using P/T-net verification techniques. An important as...
متن کاملAn Upward Compatible Timed Extension to LOTOS
We propose a timed extension of LOTOS, denoted TLOTOS, which is upward compatible with the standard LOTOS. It means first that a timed behaviour expression which does not use any language extension will have the same semantics as in standard LOTOS. In addition, we have pushed this upward compatibility one step beyond by requiring and obtaining that all the familiar equivalence laws of standard ...
متن کاملCompilation et vérification de programmes LOTOS
LOTOS (Language Of Temporal Ordering Specification) is a language for the description of concurrent and communicating systems, standardized by ISO and CCITT to allow formal definition of telecommunication protocols and services. LOTOS is based on algebraic abstract types to specify data structures and on a process calculus, close to CSP and CCS, to express control structures. This thesis propos...
متن کاملProcess Algebra Traces Augmented with Causal Relationships
Process algebraic specification languages, i.e., CSP, CCS, LOTOS, etc., are semantically founded in the notion of interleaved traces of events. Unfortunately such traces are inadequate when the dimension of “real” time is considered since a totally ordered trace cannot model two or more time-consuming events overlapping in time. As a first step towards solving this problem, it is explained how,...
متن کامل